Current-State Opacity Formulations in Probabilistic Finite Automata
نویسندگان
چکیده
منابع مشابه
Learning Probabilistic Residual Finite State Automata
We introduce a new class of probabilistic automata: Probabilistic Residual Finite State Automata. We show that this class can be characterized by a simple intrinsic property of the stochastic languages they generate (the set of residual languages is finitely generated) and that it admits canonical minimal forms. We prove that there are more languages generated by PRFA than by Probabilistic Dete...
متن کاملLearning Probabilistic Finite Automata
Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We report here a number of results concerning the learnability of these finite state machines. In the setting of identification in the limit with probability one, we prove that stochastic deterministic finite automata cannot be identified from only a polynomial quantity of data. If concerned wit...
متن کاملVector space formulation of probabilistic finite state automata
Article history: Received 16 January 2010 Received in revised form 21 December 2011 Accepted 7 February 2012 Available online 10 February 2012
متن کاملPAC-learnability of Probabilistic Deterministic Finite State Automata
We study the learnability of Probabilistic Deterministic Finite State Automata under a modified PAC-learning criterion. We argue that it is necessary to add additional parameters to the sample complexity polynomial, namely a bound on the expected length of strings generated from any state, and a bound on the distinguishability between states. With this, we demonstrate that the class of PDFAs is...
متن کاملResidual Finite State Automata
We introduce a subclass of non deterministic finite automata (NFA) that we call Residual Finite State Automata (RFSA): a RFSA is a NFA all the states of which define residual languages of the language it recognizes. We prove that for every regular language L, there exists a unique RFSA that recognizes L and which has both a minimal number of states and a maximal number of transitions. Moreover,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2014
ISSN: 0018-9286,1558-2523
DOI: 10.1109/tac.2013.2279914